package org.leetcode.middle.leetcode450;

import org.algorithm.Tree.TreeNode;

public class Solution {
    public TreeNode deleteNode(TreeNode root, int key) {

        //TODO 找到要删除的点

        //TODO 找到合适的后继节点

        //TODO 将后续节点替换要删除的点，并将原来的后续节点置null

        return null;
    }
}
